Hamilton–Jacobi equations for nonsymmetric matrix inference

نویسندگان

چکیده

We study the high-dimensional limit of free energy associated with inference problem a rank-one nonsymmetric matrix. The matrix is expressed as outer product two vectors, not necessarily independent. distributions vectors are only assumed to have scaled bounded supports. bound difference between and solution suitable Hamilton–Jacobi equation in terms much simpler quantities: concentration rate this energy, convergence decoupled system. To demonstrate versatility approach, we apply our result i.i.d. case spherical case. By plugging estimates quantities, identify limits obtain rates.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M-matrix

The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive and one with negative real part. When both these eigenvalues are exactly zero, the problem is called critical or null recurrent. While in this case the problem...

متن کامل

General Matrix Pencil Techniques for Solving Discrete-Time Nonsymmetric Algebraic Riccati Equations

A discrete–time nonsymmetric algebraic Riccati system which incorporates as special cases various discrete–time nonsymmetric algebraic Riccati equations is introduced and studied without any restrictive assumptions on the matrix coefficients. Necessary and sufficient existence conditions together with computable formulas for the stabilizing solution are given in terms of proper deflating subspa...

متن کامل

On Some Extended Block Krylov Based Methods for Large Scale Nonsymmetric Stein Matrix Equations

In the present paper, we consider the large scale Stein matrix equation with a low-rank constant term AXB − X + EFT = 0. These matrix equations appear in many applications in discrete-time control problems, filtering and image restoration and others. The proposed methods are based on projection onto the extended block Krylov subspace with a Galerkin approach (GA) or with the minimization of the...

متن کامل

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Applied Probability

سال: 2022

ISSN: ['1050-5164', '2168-8737']

DOI: https://doi.org/10.1214/21-aap1739